因素空间与概念内涵的表示

本文综合应用因素空间、信息系统和重于关系的方法,讨论了概念的内涵表示及其他有关问题。特别是,对在描述概念问题中不同于内涵和外延的第三种方法,即典型示范表示做了进一步的分析。     

强链回归集与强跟踪性

为了研究强跟踪性，本文给出了强链回归集的定义．证明了：若度量空间上的一个连续自映射有强跟踪性，则其强链回归集与极限集相同．     

Fuzzy Entropy： Axiomatic Definition and Neural Networks Model

The measure of uncertainty is adopted as a measure of information. The measures of fuzziness are known as fuzzy information measures. The measure of a quantity of fuzzy information gained from a fuzzy set or fuzzy system is known as fuzzy entropy. Fuzzy entropy has been focused and studied by many researchers in various fields. In this paper, firstly, the axiomatic definition of fuzzy entropy is discussed. Then, neural networks model of fuzzy entropy is proposed, based on the computing capability of neural networks. In the end, two examples are discussed to show the efficiency of the model.     

平面凸集存在最小凸生成集的充要条件

本文在平面上解决了StevenRLay在 [1 ]中提出的开放性问题“什么样的凸集存在唯一的最小凸生成子集” ,给出并证明了“平面上的凸集存在唯一的最小凸生成子集”的一个充要条件 .同时证明了En 中的开集一定不存在最小凸生成集 .     

Polynomial-time approximation schemes for packing and piercing fat objects

We consider two problems: given a collection of n fat objects in a fixed dimension, (1) ( packing) find the maximum subcollection of pairwise disjoint objects, and (2) ( piercing) find the minimum point set that intersects every object. Recently, Erlebach, Jansen, and Seidel gave a polynomial-time approximation scheme (PTAS) for the packing problem, based on a shifted hierarchical subdivision method. Using shifted quadtrees, we describe a similar algorithm for packing but with a smaller time bound. Erlebach et al.'s algorithm requires polynomial space. We describe a different algorithm, based on geometric separators, that requires only linear space. This algorithm can also be applied to piercing, yielding the first PTAS for that problem.     

About the Notion of Semiring of Sets

We introduce a generalized notion of semiring and prove that all known properties that semirings have according to the old definition are preserved.     

Geometric separation and exact solutions for the parameterized independent set problem on disk graphs

We consider the parameterized problem, whether for a given set  of n disks (of bounded radius ratio) in the Euclidean plane there exists a set of k non-intersecting disks. For this problem, we expose an algorithm running in time that is—to our knowledge—the first algorithm with running time bounded by an exponential with a sublinear exponent. For λ-precision disk graphs of bounded radius ratio, we show that the problem is fixed parameter tractable with a running time  . The results are based on problem kernelization and a new “geometric ( -separator) theorem” which holds for all disk graphs of bounded radius ratio. The presented algorithm then performs, in a first step, a “geometric problem kernelization” and, in a second step, uses divide-and-conquer based on our new “geometric separator theorem.”     

无界区域R1上推广的B-BBM方程的整体吸引子

本文研究了无界区域R^1上推广的B—BBM方程的长时间动力学行为，证明了该方程整体吸引子的存在性．     

广义向量均衡问题的解与解集的凸性

引进集值映射的锥真拟凹概念，讨论一类具有集值映射的广义向量衡问题解的存在性与解集的凸性。     

Levy area for the free Brownian motion: existence and non-existence

This note extends the work of Capitaine (J. Funct. Anal. 179 (1) (2001) 153) on the Levy area process for the free Brownian motion in two directions. First, we reprove that a Levy area for the Free Brownian motion exists in the Von Neumann tensor product, by exhibiting a non-commutative Burkholder-Davis-Gundy type inequality. Then, we show that there does not exist a Levy area in the projective tensor product.